Concepts of Data-Sparse Tensor-Product Approximation in Many-Particle Modelling
نویسندگان
چکیده
We present concepts of data-sparse tensor approximations to the functions and operators arising in many-particle models of quantum chemistry. Our approach is based on the systematic use of structured tensor-product representations where the low-dimensional components are represented in hierarchical or wavelet based matrix formats. The modern methods of tensor-product approximation in higher dimensions are discussed with the focus on analytically based approaches. We give numerical illustrations which confirm the efficiency of tensor decomposition techniques in electronic structure calculations. AMS Subject Classification: 65F30, 65F50, 65N35, 65F10
منابع مشابه
Max - Plan k - Institut für Mathematik in den Naturwissenschaften Leipzig Concepts of Data - Sparse Tensor - Product Approximation in Many - Particle Modelling
متن کامل
BEST APPROXIMATION IN QUASI TENSOR PRODUCT SPACE AND DIRECT SUM OF LATTICE NORMED SPACES
We study the theory of best approximation in tensor product and the direct sum of some lattice normed spacesX_{i}. We introduce quasi tensor product space anddiscuss about the relation between tensor product space and thisnew space which we denote it by X boxtimesY. We investigate best approximation in direct sum of lattice normed spaces by elements which are not necessarily downwardor upward a...
متن کاملTensor Product Multiscale Many-Particle Spaces with Finite-Order Weights for the Electronic Schrödinger Equation
In this article we combine the favorable properties of efficient Gaussian type orbitals basis sets, which are applied with good success in conventional electronic structure methods, and tensor product multiscale bases, which provide guaranteed convergence rates and allow for adaptive resolution. To this end, we develop and study a new approach for the treatment of the electronic Schrödinger equ...
متن کاملStructured data-sparse approximation to high order tensors arising from the deterministic Boltzmann equation
We develop efficient data-sparse representations to a class of high order tensors via a block many-fold Kronecker product decomposition. Such a decomposition is based on low separation-rank approximations of the corresponding multivariate generating function. We combine the Sinc interpolation and a quadrature-based approximation with hierarchically organised block tensor-product formats. Differ...
متن کاملTime Integration of Tensor Trains
A robust and efficient time integrator for dynamical tensor approximation in the tensor train or matrix product state format is presented. The method is based on splitting the projector onto the tangent space of the tensor manifold. The algorithm can be used for updating time-dependent tensors in the given data-sparse tensor train / matrix product state format and for computing an approximate s...
متن کامل